package com.LeeCode;

/**
 * 判断根结点是否等于子结点之和
 */

public class Code2236 {
    public static void main(String[] args) {

    }

    public boolean checkTree(TreeNode root) {
        int sum = root.left.val + root.right.val;
        return sum == root.val;
    }
}
